The Generational Garbage collection involves organizing the heap intodifferent divisions of memory space in-order to filter long-lived objects fromshort-lived objects through moving the surviving object of each generationGarbage Collection cycle to another memory space updating its age andreclaiming space from the dead ones. The problem in this method is that thelonger an object is alive during its initial generations the longer the garbagecollector will have to deal with it by checking for its reachability from theroot and promoting it to other space divisions where as the ultimate goal ofthe Garbage Collector is to reclaim memory from unreachable objects at aminimal time possible. This paper is a proposal of a method where the lifetimeof every object getting into the heap will be predicted and will be placed inheap accordingly for the garbage collector to deal more with reclaiming spacefrom dead objects and less in promoting the live ones to the higher level.
展开▼
